Preservation theorems and restricted consistency statements in bounded arithmetic
نویسندگان
چکیده
منابع مشابه
Unprovability of Consistency Statements in Fragments of Bounded Arithmetic
This paper deals with the weak fragments of arithmetic PV and S\ and their induction-free fragments PV and S^ • We improve the bootstrapping of 5^, which allows us to show that the theory S\ can be axiomatized by the set of axioms BASIC together with any of the following induction schemas: Y,\-PIND, Y,\-LIND, H^PINDOT U\-LIND. We improve prior results of Pudlak, Buss and Takeuti establishing th...
متن کاملPreservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملConsistency proof of a feasible arithmetic inside a bounded arithmetic
Ever since Buss showed the relation of his hierarchy of bounded arithmetic S 2, i = 1, 2, . . . to polynomial-time hierarchy of computational complexity [2], the question of whether his hierarchy is collapsed at some i = n or not, has become one of the central questions of bounded arithmetic. This is because the collapse of Buss’s hierarchy implies the collapse of polynomial-time hierarchy. In ...
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملProving Consistency of Equational Theories in Bounded Arithmetic
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symbols. We show that consistency of such equational theories can be proved in the weak fragment of arithmetic S 2 . In particular this solves an open problem formulated by Takeuti (c.f. [5, p.5 problem 9.])
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2004
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.11.003